Generating Avoidance Motion Using Motion Graph
نویسندگان
چکیده
We propose a method of generating avoidance motions. We use a motion graph to generate continuous motions, including both avoidance and other kinds of motions. In the combat of real humans, trained fighters avoid an attack with minimal movement. To realize such avoidance motion, we developed criteria to find an appropriate path (series of edges) in the motion graph. The characters are expected to move their body by only a minimal distance to avoid an attack. We introduced attack, body and avoidance space– time volumes to evaluate this criterion. Each candidate path is evaluated according to the distance between attack and body volumes and the overlap between attack and avoidance volumes. We also introduced a method to control the execution speeds of edges, and thus adjust the timing of avoidance motions. Moreover, to find a path in real time, we developed methods to facilitate the searching process such as the use of grid-based indices to look up candidate paths and GPU-based quick collision detection to cull candidate paths. We tested our approach on an application in which a character avoids incoming balls controlled by a user and demonstrated the effectiveness of our approach.
منابع مشابه
Singularity Avoidance as Manipulability Maximization Using Continuous Time Gaussian Processes
A significant challenge in motion planning is to avoid being in or near singular configurations, that is, configurations in joint space that result in the loss of the ability to move in certain directions in task space. A robotic system’s manipulability is reduced even in regions that are in close proximity to (i.e., neighbouring) a singularity. In this work we examine singularity avoidance in ...
متن کاملMobile Robot Online Motion Planning Using Generalized Voronoi Graphs
In this paper, a new online robot motion planner is developed for systematically exploring unknown environ¬ments by intelligent mobile robots in real-time applications. The algorithm takes advantage of sensory data to find an obstacle-free start-to-goal path. It does so by online calculation of the Generalized Voronoi Graph (GVG) of the free space, and utilizing a combination of depth-first an...
متن کاملMotion Planning for Nonlinear Underactuated Vehicles using H∞ Techniques
This paper presents a new solution to the motion planning problem for nonlinear underactuated vehicles. The approach solves the problem by generating a polynomial curve connecting the desired initial and final positions for the vehicle and then using the curve to estimate the vehicle’s complete configuration along the trajectory. The algorithm introduces an iterative H∞filter to improve upon th...
متن کاملTrajectory Control of Curve Constrained Hyper-Redundant Space Manipulator
This paper presents a methodology to control motion planning of a hyper-redundant planar pace robot tracing a specified end-effector path. For this, a space robot of 6 DOF has been considered for study. A hyperredundancy enhances the capability to realize various kinds of task, i.e., obstacle avoidance, joint limits, singularity avoidance, etc. For full utilization of its potential capability, ...
متن کاملDirect Optimal Motion Planning for Omni-directional Mobile Robots under Limitation on Velocity and Acceleration
This paper describes a low computational direct approach for optimal motion planning and obstacle avoidance of Omni-directional mobile robots within velocity and acceleration constraints on the robot motion. The main purpose of this problem is the minimization of a quadratic cost function while limitation on velocity and acceleration of robot is considered and collision with any obstacle in the...
متن کامل